Methods for programming a memory device and memory devices

ABSTRACT

Methods for programming memory cells and memory devices are disclosed. One such method for programming includes performing a program verify operation of a group of memory cells. A number of potential CS2 situations are detected. If the number of detected potential CS2 situations is greater than a threshold, programming compensation for a CS2 situation is used in a subsequent programming operation.

RELATED APPLICATION

This is a continuation of U.S. patent Ser. No. 13/039,778, titled“METHODS FOR PROGRAMMING A MEMORY DEVICE AND MEMORY DEVICES”, filed Mar.3, 2011 (allowed), which is commonly assigned and incorporated herein byreference.

TECHNICAL FIELD

The present invention relates generally to memory and a particularembodiment relates to reduction of program disturb in non-volatilememory.

BACKGROUND

Flash memory devices have developed into a popular source ofnon-volatile memory for a wide range of electronic applications. Flashmemory devices typically use a one-transistor memory cell that allowsfor high memory densities, high reliability, and low power consumption.Common uses for flash memory include personal computers, personaldigital assistants (PDAs), digital cameras, and cellular telephones.Program code and system data such as a basic input/output system (BIOS)are typically stored in flash memory devices for use in personalcomputer systems.

A flash memory is a type of memory that can be erased and reprogrammedin blocks instead of one byte at a time. A typical flash memorycomprises a memory array organized in columns and rows. Changes inthreshold voltage of the memory cells, through programming of chargestorage structures (e.g., floating gates or charge traps) or otherphysical phenomena (e.g., phase change or polarization), determine thedata value of each cell. The cells are usually grouped into blocks. Eachof the cells within a block can be electrically programmed, such as bycharging the charge storage structure. The data in a cell of this typeis determined by the presence or absence of the charge in the chargestorage structure. The charge can be removed from the charge storagestructure by an erase operation.

A NAND non-volatile memory array is typically organized such that aplurality of memory cells share a common access line (e.g., word line)and a plurality of series strings of memory cells are coupled to acommon data line (e.g., bit line). Due in part to this structure, memorycells can suffer from program disturb during a programming operation.Program disturb is the change in the threshold voltages of memory cellsthat are not being programmed as a result of voltages being applied tocommon word and bit lines and/or coupling effects from adjacent memorycells being programmed.

For example, if a series string of memory cells is inhibited from beingprogrammed, the adjacent series strings of memory cells, on either sideof the inhibited series string, can affect the threshold voltages of theinhibited memory cells by floating gate-to-floating gate capacitivecoupling between memory cells. This can have the effect of increasingthe threshold voltages of the inhibited memory cells thus causingsubsequent read errors.

One typical prior art way to reduce programming disturb is to generate apair of programming pulses for each word line only during a fixed numberof middle range programming pulses (e.g., a particular group ofprogramming pulses of a series of programming pulses to program a memorycell). By alternating inhibition of the adjacent bit lines, one adjacentbit line of memory cells is programmed with the first of the pair ofprogramming pulses and the other adjacent bit line of memory cells isprogrammed with the second of the pair of programming pulses. Thus, onlyone adjacent bit line of memory cells is programmed at any one timeduring the fixed number of pairs of programming pulses. A singleprogramming pulse is used at other times during the series ofprogramming pulses. However, using a fixed number of pairs ofprogramming pulses can result in increased programming time as well asother drawbacks.

For the reasons stated above, and for other reasons stated below thatwill become apparent to those skilled in the art upon reading andunderstanding the present specification, there is a need in the art toreduce the effects of program disturb in a memory device.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 shows a block diagram of one embodiment of a memory array andpage buffer with adjacent bit line counter.

FIG. 2 shows a schematic diagram of one embodiment of a portion of amemory array in accordance with the block diagram of FIG. 1.

FIG. 3 shows a more detailed schematic diagram of one embodiment of theblock diagram of FIG. 7.

FIG. 4 shows a flowchart of one embodiment of a method for reducingprogram disturb.

FIG. 5 shows a graph of one embodiment of probability of adjacent bitline programming versus time over a graph of word line voltages versustime that can result from the embodiment of FIG. 4.

FIG. 6 shows a block diagram of one embodiment of a memory system thatcan incorporate the embodiments for reducing program disturb.

FIG. 7 shows a block diagram of one embodiment of data line and pagebuffer architecture.

DETAILED DESCRIPTION

In the following detailed description, reference is made to theaccompanying drawings that form a part hereof and in which is shown, byway of illustration, specific embodiments. In the drawings, likenumerals describe substantially similar components throughout theseveral views. Other embodiments may be utilized and structural,logical, and electrical changes may be made without departing from thescope of the present disclosure. The following detailed description is,therefore, not to be taken in a limiting sense.

FIG. 1 illustrates a block diagram of one embodiment of a memory array101 coupled to a page buffer block 103. A potential column strip 2 (CS2)situation counter 105 (as described subsequently) is coupled to the pagebuffer block 103.

The page buffer block 103 comprises a plurality of page buffers. Eachpage buffer contains inhibit information for its respective bit line.The inhibit information can include an indication of whether a memorycell coupled to the respective bit line has passed or failed a programverify operation. If the memory cell has passed the program verifyoperation, the bit line should be inhibited to prevent any furtherprogramming of the memory cell. Thus, the inhibit information willindicate that the bit line has passed the program verify. A failindication in the inhibit information indicates that the memory cell hasfailed the program verify operation and additional programming might beneeded. One example of inhibit information is a bit that has a firststate (e.g., logical 1) to indicate a pass condition and another state(e.g., logical 0) to indicate a fail condition.

As will be discussed subsequently with reference to FIGS. 3 and 7, thepotential CS2 situation counter 105 counts indicators that adjacent bitlines within a selected page have failed a program verify operation(e.g., potential CS2 situations). A CS2 situation comprises an inhibitedmemory cell column (e.g., data or bit line) that is bordered on eitherside by memory cell columns (e.g., data or bit lines) that are stillbeing programmed (e.g., have failed the program verify). When the numberof potential CS2 situations is greater than a particular thresholdnumber of potential CS2 situations, at least one subsequent programmingoperation is compensated in order to reduce program disturb. As usedherein, the phrase “greater than a threshold” is intended to mean thesame thing as “greater than or equal to a threshold” if what is beingreferred to as a threshold is different.

As subsequently described in greater detail, the compensation can takethe form of one or more double programming pulses and/or an increasedV_(pass) voltage on unselected access lines (e.g., word lines) and/or analtered bit line inhibit voltage. For example, if the count is greaterthan the particular threshold, one or more double programming pulses atthe same amplitude can be generated. The first programming pulse isapplied to control gates of memory cells on half of the bit lines of thegroup of memory cells (e.g., page) being programmed while the secondprogramming pulse at the same amplitude is applied to control gates ofmemory cells on the other half of the bit lines of the group of memorycells (e.g., page) being programmed. Thus, the memory cells on bit lineson either side of an inhibited bit line are not simultaneously beingprogrammed.

In another embodiment, the V_(pass) voltage applied to the unselectedword lines during the programming operation is increased from a nominalvoltage (e.g., 9V-10V) to an increased voltage (e.g., 11V). Theincreased V_(pass) voltage should not be high enough to turn on thememory cells coupled to the increased V_(pass) biased word line.

FIG. 2 illustrates a schematic diagram of one embodiment of a portion ofthe NAND architecture memory array 101, as illustrated in FIG. 1,comprising series strings of non-volatile memory cells. The presentembodiments of the memory array are not limited to the illustrated NANDarchitecture. Alternate embodiments can use NOR or other architecturesas well.

The memory array 101 comprises an array of non-volatile memory cells(e.g., floating gate) arranged in columns such as series strings 204,205. Each of the cells is coupled drain to source in each series string204, 205. An access line (e.g. word line) WL0-WL31 that spans acrossmultiple series strings 204, 205 is coupled to the control gates of eachmemory cell in a row in order to bias the control gates of the memorycells in the row. Data lines, such as even/odd bit lines BL_E, BL_O, arecoupled to the series strings and eventually coupled to sense circuitrythat detect the state of each cell by sensing current or voltage on aselected bit line.

Each series string 204, 205 of memory cells is coupled to a source line206 by a source select gate 216, 217 (e.g., transistor) and to anindividual bit line BL_E, BL_O by a drain select gate 212, 213 (e.g.,transistor). The source select gates 216, 217 are controlled by a sourceselect gate control line SG(S) 218 coupled to their control gates. Thedrain select gates 212, 213 are controlled by a drain select gatecontrol line SG(D) 214.

Each memory cell can be programmed as a single level cell (SLC) or amultiple level cell (MLC). Each cell's threshold voltage (V_(t)) isindicative of the data that is stored in the cell. For example, in anSLC, a V_(t) of 2.5V might indicate a programmed cell while a V_(t) of−0.5V might indicate an erased cell. An MLC uses multiple V_(t) rangesthat each indicates a different state. Multilevel cells can takeadvantage of the analog nature of a traditional flash cell by assigninga bit pattern to a specific V_(t) range. This technology permits thestorage of data values representing two or more bits per cell, dependingon the quantity of V_(t) ranges assigned to the cell.

FIG. 7 illustrates one embodiment of the bit line and page bufferarchitecture of FIGS. 1 and 2. The page buffers 701, 702 are shown asbeing coupled to the bit lines and outputting DTG0-DTG7 lines. Oneembodiment of the page buffer circuitry is illustrated in greater detailin FIG. 3 and described subsequently.

The illustrated embodiment assumes an even page is selected forprogramming. Thus, BL0 is coupled to DTG0, BL2, is coupled to DTG1, BL4is coupled to DTG2, BL6 is coupled to DTG3, BL8 is coupled to DTG4, BL10is coupled to DTG5, BL12 is coupled to DTG6, and BL14 is coupled toDTG7.

The subsequent description assumes that the even page is the selectedpage for programming. However, the present method for programming canalso be executed in substantially the same manner with the odd pagebeing the selected page for programming.

FIG. 3 illustrates a more detailed schematic diagram of one embodimentof the block diagram of FIG. 7. For purposes of clarity, this embodimentillustrates only three bit lines BL0, BL2, and BL14 (e.g., representing8 even bit lines) and three latches 300-302 of the page buffer 701 ofFIG. 7. Alternate embodiments can implement greater than eight bit lines(e.g., multiples of eight bit lines), each coupled to a different latch.

The even bit lines BL0-BL14 from the memory array are coupled to thelatches 300-302 of the page buffer 103. In one embodiment, each of theselatches 300-302 can also be referred to as a primary data cache (PDC).Each of the latches comprises two inverters 310-315.

An output of each latch 300-302 is coupled to a control connection(e.g., base) of a transistor 325-327. The collector of the transistor325-327 is coupled to an inverter 320-323 with a pulled up input. Theemitters of the transistors 325-327 are coupled to a reference, such asground. A pair of inverters 320, 321 and 322, 323 from different latches300-302 is coupled to the inputs of a logical AND gate 329-331. Theoutputs of the AND gates 329-331 are input to a counter 332 that outputsa count (e.g., count of failed adjacent bit lines).

In one embodiment, one AND gate 330 has inputs (DTG7_n-1 and DTG0) fromboth the previous page bit line BL7_n-1 (DTG7_n-1) and the current pagebit line BL0 (DTG0) since the BL7_n-1 (DTG7_n-1) bit line from theprevious page is considered adjacent to the BL0 bit line of the currentselected page. The next AND gate 329 has inputs from BL2 (DTG1) and BL4(DTG2). This pattern repeats for the page to the final AND gate 331 thathas BL12 (DTG6) and BL14 (DTG7) inputs.

In operation, when a memory cell coupled to a bit line fails a programverify operation, the bit line is at a first logical state (e.g.,logical 0). This state is input to the bit line's respective latch300-302. If it is assumed that memory cells coupled to their respectivebit lines of BL0 and BL2 have failed their respective program verifyoperations, BL0 and BL2 are at a logical 0 state. Thus, the output ofthe inverters 311, 313 will be the inverse of their input logical state(e.g., logical 1). Alternate embodiments can use alternate logicalstates from those discussed.

A logical 1 applied to the base connection of the transistors 325, 326will turn on the transistors 325, 326. Since the collectors of thetransistors 325, 326 are coupled to the pulled up inputs of theirrespective inverters 320, 321, the turned on transistors 325, 326 willpull down the inverter inputs to approximately ground (e.g., logical 0).Thus, each inverter 320, 321 now has a logical 0 applied to its input.The inverters 320, 321 output a logical 1 state to the inputs of thelogical AND gate 330 which outputs a logical 1 to the counter 332.

The counter 332 outputs a count of all of the logical AND gates thathave output a logical 1. Since the inputs of each AND gate 329-331corresponds to a respective pair of adjacent bit lines (e.g., adjacenton the same selected page), the count represents the number of adjacentbit lines on the same selected page that have indicated at least onefailed program verify operation which is a potential CS2 situation. Thecount thus indicates the number of potential CS2 situations for a givenselected page. If the number of potential CS2 situations for the givenselected page is greater than a particular threshold, a CS2 situation ispresent.

FIG. 4 illustrates a flowchart of one embodiment of a method forreducing program disturb. A programming pulse, of a series ofprogramming pulses, is applied to control gates of a group (e.g., page)of memory cells 401. A program verify operation is performed, after eachprogramming pulse, on the memory cells being programmed 403. The numberof potential CS2 situations is then counted 405. In one embodiment, thenumber of potential CS2 situations is the number of memory cells,coupled to adjacent bit lines on the selected page, that failed theprogram verify operation (e.g., still need to be programmed). In oneembodiment, the circuitry of FIG. 3 can be used to count the number offailed adjacent bit lines on the selected page and, thus, the number ofpotential CS2 situations.

The number of potential CS2 situations is compared to a particularthreshold of CS2 situations 407. If the number of potential CS2situations is greater than the threshold, it has been determined that aCS2 situation exists. In this case, it is determined if program disturbcompensation should be generated 409. This can be decided by determiningthe programming pulse number or determining the previous programmingpulse voltage (e.g., pulse amplitude). Possible program disturbcompensation could include double programming pulses during thefollowing program operation, an increased pass voltage (V_(pass))(relative to V_(pass) of previous programming operations) on unselectedaccess lines (e.g., word lines) during the following program operation,or changing the inhibit voltages of failed bit lines (relative to theinhibit voltages of previous programming operations) during thefollowing program operation. The inhibit voltages are changed for asubsequent programming operation such that memory cells on failed datalines on either side of a passed data line are not programmedsimultaneously.

For example, referring to the graph of FIG. 5, it can be seen that ifmemory cells on adjacent bit lines have failed within the first threeprogramming pulses, no program disturb compensation is needed since theprogramming voltage is still relatively low and should not causeprogramming disturb. However, as the programming voltage increases, thelikelihood of a programming disturb condition affecting the programmingof memory cells also increases. Thus, after a particular programmingvoltage or a particular quantity of programming pulses 501 (e.g.,programming pulse count threshold), double programming pulses 503, 505having the same amplitude (or an increased V_(pass) voltage) aregenerated during a subsequent programming operation 413. One programmingpulse 503 is used to program memory cells on one of each of the pairs offailed adjacent bit lines and the second programming pulse 505 is usedto program memory cells on the other of each of the pairs of failedadjacent bit lines. If there is no indication of a CS2 situation 407 orprogram disturb compensation is not considered necessary 409, thesubsequent programming pulse can be a normal incremented programmingpulse 411. Alternate embodiments can generate other forms of programdisturb compensation 413.

The embodiment of FIG. 5 is for purposes of illustration only. Thepresent embodiments are not limited to any one quantity of programmingpulses or programming voltages in order to determine if doubleprogramming pulses should be generated.

FIG. 6 illustrates a functional block diagram of a memory device 600 aspart of a memory system 620. The memory device 600 is coupled to anexternal controller 610. The controller 610 may be a microprocessor orsome other type of controlling circuitry. The memory device 600 has beensimplified to focus on features of the memory that are helpful inunderstanding the present invention.

The memory device 600 includes an array 630 of non-volatile memorycells, such as the one illustrated previously in FIG. 1. The memoryarray 630 is arranged in banks of word line rows and bit line columns.In one embodiment, the columns of the memory array 630 are comprised ofseries strings of memory cells as illustrated in FIG. 1. As is wellknown in the art, the connections of the cells to the bit linesdetermines whether the array is a NAND architecture, an ANDarchitecture, or a NOR architecture.

Address buffer circuitry 640 is provided to latch address signalsprovided through the I/O circuitry 660. Address signals are received anddecoded by a row decoder 644 and a column decoder 646 to access thememory array 630. It will be appreciated by those skilled in the art,with the benefit of the present description, that the number of addressinput connections depends on the density and architecture of the memoryarray 630. That is, the number of addresses increases with bothincreased memory cell counts and increased bank and block counts.

The memory device 600 reads data in the memory array 630 by sensingvoltage or current changes in the memory array columns using sensecircuitry. The sense circuitry 650, in one embodiment, is coupled toread and latch a row of data from the memory array 630. The sensecircuitry 650 can include the page buffers as described herein. Datainput and output buffer circuitry 660 is included for bidirectional datacommunication as well as address communication over a plurality of dataconnections 662 with the controller 610. Write circuitry 655 is providedto write data to the memory array.

Memory control circuitry 670 decodes signals provided on controlconnections 672 from the external controller 610. These signals are usedto control the operations on the memory array 630, including data read,data write (program), and erase operations. The memory control circuitry670 may be a state machine, a sequencer, or some other type of controlcircuitry to generate the memory control signals. In one embodiment, thememory control circuitry 670 is configured to control generation ofmemory control signals as a result of execution of the method forreducing program disturb.

The flash memory device illustrated in FIG. 6 has been simplified tofacilitate a basic understanding of the features of the memory. A moredetailed understanding of internal circuitry and functions of flashmemories are known to those skilled in the art.

CONCLUSION

In summary, one or more embodiments of the disclosed methods forprogramming include determining a number of potential CS2 situations(e.g., if any memory cells of adjacent bit lines have failed a programverify). If the number of potential CS2 situations is greater than aparticular threshold, program disturb compensation might be generated.

Although specific embodiments have been illustrated and describedherein, it will be appreciated by those of ordinary skill in the artthat any arrangement that is calculated to achieve the same purpose maybe substituted for the specific embodiments shown. Many adaptations ofthe invention will be apparent to those of ordinary skill in the art.Accordingly, this application is intended to cover any adaptations orvariations of the invention. It is intended that this invention belimited only by the following claims and equivalents thereof.

What is claimed is:
 1. A method of programming a memory, comprising:counting indicators that adjacent data lines within a selected page havefailed a program verify operation; and adjusting at least one subsequentprogramming operation when a number of counted indicators is greaterthan a threshold.
 2. The method of claim 1, wherein counting comprisesdetecting the number of indicators for a particular programming step. 3.The method of claim 2, wherein adjusting comprises compensating in aprogramming step following the particular programming step.
 4. Themethod of claim 3, wherein compensating comprises generating a pluralityof programming pulses in the programming step following the particularprogramming step.
 5. The method of claim 3, wherein compensatingcomprises increasing a pass voltage used in the programming stepfollowing the particular programming step.
 6. The method of claim 1, andfurther comprising detecting a number of pulses applied in a particularprogramming operation, wherein compensating is responsive to the numberof detected applied pulses being greater than a pulse number threshold.7. The method of claim 3, wherein compensating comprises altering a dataline inhibit voltage in the programming step following the particularprogramming step.
 8. The method of claim 1, wherein counting indicatorscomprises detecting a number of adjacent data lines in the selected pagethat have failed a program verify operation comprises detecting a numberof adjacent data lines coupled to memory cells in the selected page thathave failed a program verify operation for a particular programmingstep, wherein the first page of memory cells comprises a number ofmemory cells having commonly coupled control gates, and wherein thenumber of memory cells of the selected page are interleaved with anumber of memory cells of a second page.
 9. The method of claim 1,wherein detecting a number of adjacent data lines in a page that havefailed a program verify operation comprises detecting a number ofadjacent data lines coupled to memory cells in a second page that havefailed a program verify operation for a particular programming step ofthe selected page, wherein the second page of memory cells comprises anumber of memory cells having commonly coupled control gates, andwherein the number of memory cells of the second page are interleavedwith a number of memory cells of the selected page.
 10. The method ofclaim 9, wherein detecting a number of adjacent data lines coupled tomemory cells in the selected page that have failed a program verifyoperation comprises detecting a number of adjacent data lines coupled tomemory cells in the selected page that have failed a program verifyoperation and that border a data line coupled to a memory cell in thesecond page that has passed a program verify operation.
 11. A method ofprogramming a memory, comprising: counting, for a selected page of thememory, a number of data lines having at least one adjacent data linethat has failed a program verify operation; and determining, when thenumber exceeds a threshold, whether programming should be compensated.12. The method of claim 11, wherein counting comprises detecting thenumber of indicators for a particular programming step, and furthercomprising compensating at least one subsequent programming operationwhen it is determined that programming should be compensated.
 13. Themethod of claim 12, wherein compensating comprises compensating in aprogramming step following the particular programming step.
 14. Themethod of claim 13, wherein compensating comprises generating aplurality of programming pulses in the programming step following theparticular programming step.
 15. The method of claim 13, whereincompensating comprises increasing a pass voltage used in the programmingstep following the particular programming step.
 16. The method of claim11, and further comprising detecting a number of pulses applied in aparticular programming operation, wherein compensating is responsive tothe number of detected applied pulses being greater than a pulse numberthreshold.
 17. The method of claim 14, wherein generating the pluralityof programming pulses comprises generating two programming pulses in theprogramming step following the particular programming step, wherein eachof the two programming pulses has substantially the same amplitude, thefirst of the two programming pulses applied to control gates of memorycells on half of the data lines of the selected page that are beingprogrammed, and the second of the two programming pulses applied tocontrol gates of memory cells on the other half of the data lines of theselected page being programmed.
 18. The method of claim 13, whereincompensating comprises altering a data line inhibit voltage in theprogramming step following the particular programming step.
 19. A methodof programming a memory, comprising: determining a number of situationsin a selected page of the memory for which an inhibited data lineborders at least one data line that has failed a program verify; andcompensating at least one subsequent programming operation when thenumber of determined situations exceeds a threshold.
 20. The method ofclaim 19, wherein determining comprises counting the number ofsituations for a particular programming step, and further comprisingcompensating at least one subsequent programming operation when it isdetermined that programming should be compensated.
 21. The method ofclaim 20, wherein compensating comprises compensating in a programmingstep following the particular programming step.
 22. The method of claim21, wherein compensating comprises generating a plurality of programmingpulses in the programming step following the particular programmingstep.
 23. The method of claim 22, wherein generating the plurality ofprogramming pulses comprises generating two programming pulses in theprogramming step following the particular programming step, wherein eachof the two programming pulses has substantially the same amplitude. 24.The method of claim 21, wherein compensating comprises increasing a passvoltage used in the programming step following the particularprogramming step.
 25. The method of claim 19, and further comprisingdetecting a number of pulses applied in a particular programmingoperation, wherein compensating is responsive to the number of detectedapplied pulses being greater than a pulse number threshold.
 26. Themethod of claim 19, wherein compensating comprises altering a data lineinhibit voltage in the programming step following the particularprogramming step.
 27. A memory device comprising: an array of memorycells; a plurality of page buffers coupled to the array of memory cells;and a counter coupled to the plurality of page buffers, the counter todetermine a number of adjacent data lines within a selected page thathave failed a program verify.
 28. The memory device of claim 27 whereinthe plurality of page buffers comprise a plurality of latches, whereineach latch is coupled to a different data line of the array of memorycells and each latch is configured to latch an indication of whether itsrespective data line has passed the program verify operation.
 29. Thememory device of claim 28 wherein each latch is configured to latch afirst state when memory cells coupled to its respective data line passthe program verify operation and a second, inverse state when memorycells coupled to its respective data line fail the program verifyoperation.
 30. The memory device of claim 27 wherein each pair of pagebuffers for adjacent data lines of the selected page are coupled to alogical gate that generates an indication only if both page buffersindicate a failed program verify operation.
 31. The memory device ofclaim 30 and further including a transistor coupled between each pagebuffer and the logical gate wherein the transistor is configured to turnon when its respective page buffer indicates a failed program verifyoperation.
 32. The memory device of claim 31 wherein the transistorcomprises a base connection coupled to it respective page buffer, acollector connection coupled to the logical gate, and an emitterconnection coupled to reference potential.
 33. The memory device ofclaim 30 wherein the adjacent data line counter comprises a countercoupled to outputs of each logical gate.